Monotonicity properties of certain Laplacian eigenvectors
نویسنده
چکیده
Nath and Paul (Linear Algebra Appl., 460 (2014), 97-110) have shown that the largest distance Laplacian eigenvalue of a path is simple and the corresponding eigenvector has properties similar to the Fiedler vector. We given an alternative proof, establishing a more general result in the process. AMS Classification: 05C05, 05C50
منابع مشابه
Properties of first eigenvectors and eigenvalues of nonsingular weighted directed graphs
The class of nonsingular connected weighted directed graphs with an unweighted undirected branch is considered in this article. This paper investigates the monotonicity properties of the first eigenvectors of such graphs along certain paths. The paper describes how the first eigenvalue of such graphs changes under some perturbation. It is shown that replacing a branch which is a tree by a path ...
متن کاملAdaptable Precomputation for Random Walker Image Segmentation and Registration
The random walker (RW) algorithm is used for both image segmentation and registration, and possesses several useful properties that make it popular in medical imaging, such as being globally optimizable, allowing user interaction, and providing uncertainty information. The RW algorithm defines a weighted graph over an image and uses the graph’s Laplacian matrix to regularize its solutions. This...
متن کاملLaplacian eigenvectors and eigenvalues and almost equitable partitions
Relations between Laplacian eigenvectors and eigenvalues and the existence of almost equitable partitions (which are generalizations of equitable partitions) are presented. Furthermore, on the basis of some properties of the adjacency eigenvectors of a graph, a necessary and sufficient condition for the graph to be primitive strongly regular is introduced. c © 2006 Elsevier Ltd. All rights rese...
متن کاملUsing Laplacian Eigenvalues and Eigenvectors in the Analysis of Frequency Assignment Problems
A Frequency Assignment Problem (FAP) is the problem that arises when to a given set of transmitters frequencies have to be assigned such that spectrum is used efficiently and the interference between the transmitters is minimal. In this paper we see the frequency assignment problem as a generalised graph colouring problem, where transmitters are presented by vertices and interaction between two...
متن کاملH-eigenvalues of Laplacian and Signless Laplacian Tensors
We propose a simple and natural definition for the Laplacian and the signless Laplacian tensors of a uniform hypergraph. We study their H-eigenvalues, i.e., H-eigenvalues with nonnegative H-eigenvectors, and H-eigenvalues, i.e., H-eigenvalues with positive H-eigenvectors. We show that each of the Laplacian tensor, the signless Laplacian tensor, and the adjacency tensor has at most one H-eigenva...
متن کامل